Approximation algorithms - PDFSEARCH.IO - Document Search Engine

Approximation algorithms
Results: 332

#	Item
231	Greedy Algorithms for Sparse Reinforcement Learning Christopher Painter-Wakefield Ronald Parr Duke University, Durham NC Add to Reading List Source URL: www.cs.duke.edu Language: English - Date: 2012-05-22 14:27:13 Regression analysis Learning Reinforcement learning Sparse approximation Supervised learning Feature selection Least squares Least-angle regression Static single assignment form Statistics Matching pursuit Signal processing
232	Approximate Range Searching in Higher Dimension ∗ B ERNARD C HAZELLE† D ING L IU† AVNER M AGEN‡ Abstract Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2006-08-10 19:26:15 Search algorithms Approximation algorithms Discrete geometry Mathematical optimization Nearest neighbor search Numerical analysis Range searching Information science Mathematics Information retrieval
233	Noname manuscript No. (will be inserted by the editor) Analysis and Evaluation of the Top-k Most Influential Location Selection Query Jian Chen · Jin Huang · Zeyi Wen · Add to Reading List Source URL: people.eng.unimelb.edu.au Language: English - Date: 2013-12-15 23:38:55 Information retrieval Operations research Approximation algorithms Mathematical optimization Facility location Nearest neighbor search K-nearest neighbor algorithm R-tree Selection algorithm Information science Search algorithms Mathematics
234	New Approximation Algorithms for Minimum Enclosing Convex Shapes Ankan Saha∗ S.V. N. Vishwanathan† Add to Reading List Source URL: users.cecs.anu.edu.au Language: English - Date: 2010-10-18 21:25:36 Convex optimization Applied mathematics Linear programming Approximation algorithm Subgradient method Combinatorial optimization Mathematical optimization Operations research Theoretical computer science
235	Fast Similarity Search for High-Dimensional Dataset Quan Wang and Suya You Computer Science Department University of Southern California {quanwang,suyay}@graphics.usc.edu Abstract Add to Reading List Source URL: graphics.usc.edu Language: English - Date: 2006-09-29 18:06:36 Mathematics Search algorithms Numerical analysis Information retrieval Approximation algorithms Nearest neighbor search K-nearest neighbor algorithm K-d tree R-tree Information science Artificial intelligence Machine learning
236	Approximation Algorithms for Finding Maximum Independent Sets in Unions of Perfect Graphs Authors: Chakaravarthy, Pandit, Roy, Sabharwal Speaker: Arindam Pal Department of Computer Science and Engineering Indian Institut Add to Reading List Source URL: www.cse.iitd.ernet.in Language: English - Date: 2012-12-01 01:44:16 Comparability graph Perfect graph Clique Independent set Graph coloring Trivially perfect graph Path decomposition Graph theory NP-complete problems Chordal graph
237	iDistance: An Adaptive B+-Tree Based Indexing Method for Nearest Neighbor Search H. V. JAGADISH University of Michigan BENG CHIN OOI and KIAN-LEE TAN Add to Reading List Source URL: www.ruizhang.info Language: English - Date: 2005-09-30 04:32:48 Search algorithms Searching IDistance Approximation algorithms Numerical analysis Nearest neighbor search K-nearest neighbor algorithm R-tree M-tree Information science Information retrieval Mathematics
238	ANYTIME ALGORITHMS FOR ROBDD SYMMETRY DETECTION AND APPROXIMATION a thesis submitted to The University of Kent at Canterbury in the subject of computer science Add to Reading List Source URL: www.digit-labs.org Language: English - Date: 2008-09-04 12:58:00 Analysis of algorithms Symmetry Probabilistic complexity theory Algorithm Approximation algorithm Anytime algorithm Time complexity Randomized algorithm Theoretical computer science Applied mathematics Computational complexity theory
239	ABRAHAM FLAXMAN, Carnegie Mellon University, Pittsburgh, PA, USA On the Average Case Performance of Some Greedy Approximation Algorithms for the Uncapacitated Facility Location Problem In combinatorial optimization, a po Add to Reading List Source URL: cms.math.ca Language: English - Date: 2006-07-10 21:18:20 Computational complexity theory Operations research Approximation algorithm Asymptotically optimal algorithm Algorithm Optimization problem Combinatorial optimization Facility location Greedy algorithm Theoretical computer science Applied mathematics Mathematics
240	Approximation Algorithms for Stochastic Orienteering Anupam Gupta∗ Ravishankar Krishnaswamy† Viswanath Nagarajan‡ Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2011-09-30 21:07:28 Combinatorial optimization NP-complete problems Operations research Cryptography Knapsack problem Approximation algorithm Linear programming relaxation SL Matching Theoretical computer science Computational complexity theory Applied mathematics

UPDATE